全文获取类型
收费全文 | 526篇 |
免费 | 158篇 |
国内免费 | 40篇 |
出版年
2024年 | 2篇 |
2023年 | 7篇 |
2022年 | 3篇 |
2021年 | 13篇 |
2020年 | 11篇 |
2019年 | 14篇 |
2018年 | 7篇 |
2017年 | 24篇 |
2016年 | 27篇 |
2015年 | 18篇 |
2014年 | 48篇 |
2013年 | 46篇 |
2012年 | 44篇 |
2011年 | 59篇 |
2010年 | 39篇 |
2009年 | 51篇 |
2008年 | 28篇 |
2007年 | 48篇 |
2006年 | 33篇 |
2005年 | 28篇 |
2004年 | 32篇 |
2003年 | 17篇 |
2002年 | 19篇 |
2001年 | 19篇 |
2000年 | 17篇 |
1999年 | 19篇 |
1998年 | 9篇 |
1997年 | 8篇 |
1996年 | 2篇 |
1995年 | 5篇 |
1994年 | 5篇 |
1993年 | 7篇 |
1992年 | 6篇 |
1991年 | 4篇 |
1990年 | 3篇 |
1989年 | 1篇 |
1988年 | 1篇 |
排序方式: 共有724条查询结果,搜索用时 15 毫秒
51.
52.
基于信号循环平稳特性的时延估计算法具有较强的抗干扰和抗噪声能力,但循环频率误差时性能下降严重。针对这一问题,首先分析了循环频率误差对循环时延估计算法中,循环互相关函数相关法估计性能的影响,进而提出了一种对循环频率误差稳健的改进循环时延估计算法。改进算法通过两次搜索确定循环频率的真实值。仿真实验结果表明,改进算法可以有效地校正循环频率误差,最终使时延估计误差与无循环频率误差时基本相同。 相似文献
53.
54.
55.
56.
This paper studies load balancing for many-server (N servers) systems. Each server has a buffer of size b ? 1, and can have at most one job in service and b ? 1 jobs in the buffer. The service time of a job follows the Coxian-2 distribution. We focus on steady-state performance of load balancing policies in the heavy traffic regime such that the normalized load of system is λ = 1 ? N?α for 0 < α < 0.5. We identify a set of policies that achieve asymptotic zero waiting. The set of policies include several classical policies such as join-the-shortest-queue (JSQ), join-the-idle-queue (JIQ), idle-one-first (I1F) and power-of-d-choices (Po d) with d = O(Nα log N). The proof of the main result is based on Stein's method and state space collapse. A key technical contribution of this paper is the iterative state space collapse approach that leads to a simple generator approximation when applying Stein's method. 相似文献
57.
Extending Sastry's result on the uncapacitated two‐commodity network design problem, we completely characterize the optimal solution of the uncapacitated K‐commodity network design problem with zero flow costs for the case when K = 3. By solving a set of shortest‐path problems on related graphs, we show that the optimal solutions can be found in O(n3) time when K = 3, where n is the number of nodes in the network. The algorithm depends on identifying a list of “basic patterns”; the number of basic patterns grows exponentially with K. We also show that the uncapacitated K‐commodity network design problem can be solved in O(n3) time for general K if K is fixed; otherwise, the time for solving the problem is exponential. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
58.
59.
We state a balancing problem for mixed model assembly lines with a paced moving conveyor as: Given the daily assembling sequence of the models, the tasks of each model, the precedence relations among the tasks, and the operations parameters of the assembly line, assign the tasks of the models to the workstations so as to minimize the total overload time. Several characteristics of the problem are investigated. A line‐balancing heuristic is proposed based on a lower bound of the total overload time. A practical procedure is provided for estimating the deviation of any given line‐balance solution from the theoretical optimum. Numerical examples are given to illustrate the methodology. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
60.
对定常态不可逆卡诺热机进行了有限时间热力学分析.定义了功率、效率和面积比系数,并导出三者的关系式,由此对热机最佳功率、效率和面积特性进行了分析和讨论,给出了一些有益的结论. 相似文献